Constructing the vertex-transitive graphs of order 24
نویسندگان
چکیده
منابع مشابه
Constructing the Vertex-Transitive Graphs of Order 24
This paper describes the construction of all the vertex-transitive graphs on 24 vertices, thus extending the currently available catalogues. This construction differs significantly from previous constructions of the vertex-transitive graphs of order up to 23 in that we are forced to use far more sophisticated group-theoretic techniques. We include an analysis of all the symmetric graphs on 24 v...
متن کاملConstructing vertex decomposable graphs
Recently, some techniques such as adding whiskers and attaching graphs to vertices of a given graph, have been proposed for constructing a new vertex decomposable graph. In this paper, we present a new method for constructing vertex decomposable graphs. Then we use this construction to generalize the result due to Cook and Nagel.
متن کاملConstructing Cubic Edge-but Not Vertex-transitive Graphs
Slovenija Abstract An innnite family of cubic edge-transitive but not vertex-transitive graph graphs with edge stabilizer isomorphic to Z Z 2 is constructed.
متن کاملConstructing cubic edge- but not vertex-transitive graphs
An in nite family of cubic edge transitive but not vertex transitive graph graphs with edge stabilizer isomorphic to Z is constructed
متن کاملconstructing vertex decomposable graphs
recently, some techniques such as adding whiskers and attaching graphs to vertices of a given graph, have been proposed for constructing a new vertex decomposable graph. in this paper, we present a new method for constructing vertex decomposable graphs. then we use this construction to generalize the result due to cook and nagel.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1989
ISSN: 0747-7171
DOI: 10.1016/s0747-7171(89)80033-1